A Computationally Efficient Semantic SLAM Solution for Dynamic Scenes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Computationally Efficient Solution to the Simultaneous Localisation and Map Building (SLAM) Problem

The theoretical basis of the solution to the simultaneous localisation and map building SLAM problem where an autonomous vehicle starts in an unknown location in an unknown environment and then incrementally build a map of landmarks present in this environment while simultaneously using this map to compute absolute vehicle location is now well understood Although a number of SLAM implementation...

متن کامل

Laser-based Slam with Efficient Occupancy Likelihood Map Learning for Dynamic Indoor Scenes

Location-Based Services (LBS) have attracted growing attention in recent years, especially in indoor environments. The fundamental technique of LBS is the map building for unknown environments, this technique also named as simultaneous localization and mapping (SLAM) in robotic society. In this paper, we propose a novel approach for SLAM in dynamic indoor scenes based on a 2D laser scanner moun...

متن کامل

Efficient global illumination for dynamic scenes

The production of high quality animations which feature compelling lighting effects is computationally a very heavy task when traditional rendering approaches are used where each frame is computed separately. The fact that most of the computation must be restarted from scratch for each frame leads to unnecessary redundancy. Since temporal coherence is typically not exploited, temporal aliasing ...

متن کامل

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs

We propose a computationally efficient Fully Polynomial-Time Approximation Scheme(FPTAS) to compute an approximation with arbitrary precision of the value function of convexstochastic dynamic programs, using the technique of K-approximation sets and functions introducedby Halman et al. (2009). This paper deals with the convex case only, and it has the following con-tributions: F...

متن کامل

Efficient Collision Determination for Dynamic Scenes using Coherent Separating Axis

We present an efficient algorithm for collision determination of dynamic objects undergoing rigid motion or general deformation. Our technique deals with triangulated models, and it requires no further assumption of the objects’ geometry and topology. Particularly, it efficiently handles non-convex, or even polygon-soup models, enduring any deformation process. Furthermore, it requires no compl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Remote Sensing

سال: 2019

ISSN: 2072-4292

DOI: 10.3390/rs11111363